Computing in Totally Anonymous Asynchronous Shared Memory Systems
نویسندگان
چکیده
منابع مشابه
Computing in Totally Anonymous Asynchronous Shared Memory Systems
In the totally anonymous shared memory model of asynchronous distributed computing, processes have no id's and run identical programs. Moreover, processes have identical interface to the shared memory, and in particular, there are no single-writer registers. This paper assumes that processes do not fail, and the shared memory consists only of read/write registers, which are initialized to some ...
متن کاملComputing in Totally Anonymous Asynchronous Shared Memory Systems (Extended Abstract)
(within an induction) to prove that for every k, 0 k logN ? 1, there exists an execution of 2 k+1 processes with k rounds and ending with a bivalent connguration. Taking k = logN ? 1 we get the desired lower bound: Theorem13. In the totally anonymous model, the round complexity of a protocol solving binary consensus among N processes is (log N). References 1. K. Abrahamson. On achieving consens...
متن کاملModel Checking Parameterized Asynchronous Shared-Memory Systems
We characterize the complexity of liveness verification for parameterized systems consisting of a leader process and arbitrarily many anonymous and identical contributor processes. Processes communicate through a shared, bounded-value register. While each operation on the register is atomic, there is no synchronization primitive to execute a sequence of operations atomically. We analyze the cas...
متن کاملProactive Leader Election in Asynchronous Shared Memory Systems
In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speaking, a leader election algorithm is proactive if it can tolerate failure of nodes even after a leader is elected, and (stable) leader election happens periodically. This is needed in systems where a leader is required after every...
متن کاملOn parametrized verification of asynchronous, shared-memory pushdown systems
We consider the model of parametrized asynchronous shared-memorypushdown systems as introduced in [Hague’11]. In a series of recentpapers it has been shown that reachability in this model is Pspace-complete [Esparza, Ganty, Majumdar’13] and that liveness is decidablein Nexptime [Durand-Gasselin, Esparza, Ganty, Majumdar’15]. Weshow that the liveness problem is Pspace-complet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2002
ISSN: 0890-5401
DOI: 10.1006/inco.2001.3119